Definition

A knowledge hierarchy among players in state of the world ω\omega over the set of states of the world YY is a system of "yes" or "no" answers to each question of the form "in a state of the world ω\omega, does player i1i_1 know that player i2i_2 knows that player i3i_3 knows... that player ili_l knows event AA"? for any event AYA \subseteq Y and any finite sequence i1,i2,...,ili_1, i_2, ...,i_l of players in NN.

Answer to this equation is affirmative if ωKi1Ki2...KilA\omega \in K_{i_1} K_{i_2} ... K_{i_l}A, negative otherwise.

Since for every event AA and sequence of players i1,i2,...,ili_1, i_2, ...,i_l, event Ki1Ki2...KilAK_{i_1} K_{i_2} ... K_{i_l}A is well-denited and calculable in an Aumann model of incomplete information, every state of the world defines a knowledge hierarchy.

This may be formalized as a theorem.


References

  1. M. Maschler, E. Solan, and Shmuel Zamir, Game Theory, Cambridge University Press, 2013, pp. 330-331.